On super edge-antimagicness of subdivided stars
نویسندگان
چکیده
Enomoto, Llado, Nakamigawa and Ringel (1998) defined the concept of a super (a, 0)-edge-antimagic total labeling and proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In the support of this conjecture, the present paper deals with different results on super (a, d)-edge-antimagic total labeling of subdivided stars for d ∈ {0, 1, 2, 3}.
منابع مشابه
On super edge-antimagic total labeling of subdivided stars
In 1980, Enomoto et al. proposed the conjecture that every tree is a super (a, 0)-edge-antimagic total graph. In this paper, we give a partial support for the correctness of this conjecture by formulating some super (a, d)edge-antimagic total labelings on a subclass of subdivided stars denoted by T (n, n + 1, 2n + 1, 4n + 2, n5, n6, . . . , nr) for different values of the edgeantimagic labeling...
متن کاملSuper edge-magic total labeling of subdivided stars
An edge-magic total labeling of a graph G is a one-toone map λ from V (G) ∪ E(G) onto the integers {1, 2, · · · , |V (G) ∪ E(G)|} with the property that, there is an integer constant c such that λ(x) + λ(x, y) + λ(y) = c for any (x, y) ∈ E(G). If λ(V (G)) = {1, 2, · · · , |V (G|} then edge-magic total labeling is called super edgemagic total labeling. In this paper, we formulate super edge-magi...
متن کاملSufficient conditions for maximally edge-connected and super-edge-connected
Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملOn super edge-magic total labeling of banana trees
Let G1, G2, ..., Gn be a family of disjoint stars. The tree obtained by joining a new vertex a to one pendant vertex of each star Gi is called a banana tree. In this paper we determine the super edge-magic total labelings of the banana trees that have not been covered by the previous results [15].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 35 شماره
صفحات -
تاریخ انتشار 2015